The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations
نویسندگان
چکیده
منابع مشابه
Open neighborhood locating dominating sets
For a graph G that models a facility, various detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur. Here we introduce the open neighborhood locating-dominating set problem. We seek a minimum cardinality vertex set S with the property that for each vertex v its open neighborhood N(v) has a unique non-empty intersection with S. ...
متن کاملLocating and total dominating sets in trees
Locating and Total Dominating Sets in Trees by Jamie Marie Howard A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
متن کاملLocating-dominating codes in cycles
The smallest cardinality of an r-locating-dominating code in a cycle Cn of length n is denoted by M r (Cn). In this paper, we prove that for any r ≥ 5 and n ≥ nr when nr is large enough (nr = O(r3)) we have n/3 ≤ M r (Cn) ≤ n/3 + 1 if n ≡ 3 (mod 6) and M r (Cn) = n/3 otherwise. Moreover, we determine the exact values of M 3 (Cn) and M 4 (Cn) for all n.
متن کاملIdentifying and Locating- Dominating Codes in Binary Hamming Spaces Identifying and Locating-Dominating Codes in Binary Hamming Spaces
Acknowledgements First of all I want to thank my supervisor Professor Iiro Honkala for his continuous support, and patience when long breaks in research took place. Many discussions with Iiro, his collaboration, suggestions for research topics, and careful proofreading made this work possible. I also want to thank Dr. Tero Laihonen for many inspiring discussions, suggestions for research topics...
متن کاملLocating dominating codes: Bounds and extremal cardinalities
In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our more significant contributions on λ-codes and η-codes concerning concerning bounds, extremal val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.013